#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

string s1, s2;
int book[256];

inline void solution() {
    cin >> s1 >> s2;
    for (auto& s : s1) 
        book[s] ++ ;
    int res = 0;
    for (auto& s: s2) 
        if (book[s] > 0)
            book[s] -- ;
        else
            res ++;
    if (res != 0)
        cout << "No " << res << endl;
    else
        cout << "Yes " << s1.size() - s2.size() << endl;
}

int main() {
    freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}